Symbolic Compilation of PSL

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain-Specific Symbolic Compilation

A symbolic compiler translates a program to symbolic constraints, automatically reducing model checking and synthesis to constraint solving. We show that new applications of constraint solving require domain-specific encodings that yield orders of magnitude improvements in solver efficiency. Unfortunately, these encodings cannot be obtained with today’s symbolic compilation. We introduce symbol...

متن کامل

Symbolic debugging through incremental compilation in an integrated environment

It is demonstrated that fine-grained incremental compilation is a relevant technique when implementing powerful debuggers an incremental programming environments. A debugger and an incremental compiler for PASCAL has been implemented in the DICE system (Distributed Incremental Compiling environment). Incremental compilation is at the statement level which makes it useful for the debugger which ...

متن کامل

Symbolic Transfer Function-based Approaches to Certified Compilation

We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to check that source and compiled programs present similar behaviors. This checking can be done either for a concrete semantic interpretation (Translation Validation) or for an abstract semantic interpretation (Invariant Tr...

متن کامل

Efficient Verification of PSL Properties

Hardware design engineers increasingly leverage formal properties. Nowadays properties are not only used for the formal verification of a design’s correctness, but also for the communication of design intent, and the specification of a design’s requirements. A formal specification is a first and substantial step to ensure high quality, as the unambiguous syntax leaves no room for misinterpretat...

متن کامل

The Dehn Function of Psl

We show that PSL2(Z[ 1 p ]) admits a combing with bounded asynchronous width, and use this combing to show that PSL2(Z[ 1 p ]) has an exponential Dehn function. As a corollary, PSL2(Z[ 1 p ]) has solvable word problem and is not an automatic group.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2008

ISSN: 0278-0070

DOI: 10.1109/tcad.2008.2003303